ar X iv : 0 90 5 . 35 43 v 2 [ he p - th ] 2 2 Se p 20 09 2 d GRAVITY WITH TORSION , ORIENTED MATROIDS AND 2 + 2 DIMENSIONS
نویسندگان
چکیده
We find a link between oriented matroid theory and 2d gravity with torsion. Our considerations may be useful in the context of noncommutative phase space in a target spacetime of signature (2+2) and in a possible theory of gravity ramification.
منابع مشابه
ar X iv : m at h / 02 12 23 5 v 1 [ m at h . C O ] 1 7 D ec 2 00 2 Characterizing Matchings as the Intersection of Matroids ∗
This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of two matroids, we study the function μ(G), which is the minimum number of matroids that need to be intersected in order to obtain the set of matchings on a gra...
متن کاملar X iv : 0 71 1 . 15 17 v 1 [ m at h . C O ] 9 N ov 2 00 7 COMBINATORIAL POLAR ORDERINGS AND FOLLOW - UP ARRANGEMENTS
Polar orderings arose in recent work of Salvetti and the second author on minimal CW-complexes for complexified hyperplane arrangements. We study the combinatorics of these orderings in the classical framework of oriented matroids, and reach thereby a weakening of the conditions required to actually determine such orderings. A class of arrangements for which the construction of the minimal comp...
متن کاملar X iv : m at h / 04 03 33 7 v 1 [ m at h . C O ] 2 1 M ar 2 00 4 LATTICE PATH MATROIDS : STRUCTURAL PROPERTIES
This paper studies structural aspects of lattice path matroids, a class of transversal matroids that is closed under taking minors and duals. Among the basic topics treated are direct sums, duals, minors, circuits, and connected flats. One of the main results is a characterization of lattice path matroids in terms of fundamental flats, which are special connected flats from which one can recove...
متن کاملRoudneff's Conjecture for Lawrence Oriented Matroids
J.-P. Roudneff has conjectured that every arrangement of n > 2d+1 > 5 (pseudo) hyperplanes in the real projective space Pd has at most ∑d−2 i=0 ( n−1 i ) cells bounded by each hyperplane. In this note, we show the validity of this conjecture for arrangements arising from Lawrence oriented matroids.
متن کاملar X iv : m at h / 02 12 23 5 v 2 [ m at h . C O ] 1 7 O ct 2 00 3 Characterizing Matchings as the Intersection of Matroids ∗
This paper deals with the problem of representing the matching independence system in a graph as the intersection of finitely many matroids. After characterizing the graphs for which the matching independence system is the intersection of two matroids, we study the function μ(G), which is the minimum number of matroids that need to be intersected in order to obtain the set of matchings on a gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009